The Outcome of a Know-how : a Branch-and-Bound Library
نویسندگان
چکیده
منابع مشابه
A Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)
One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...
متن کاملAn Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem
One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this pape...
متن کاملHow much do bank employees know about Islamic banking contracts (Case study: a private bank)
The non-usury law approved in 1983 is in agreement with the divine law which forbids usury. Regardless of how the loan applicant will use the financial facilities, usury banking grants loan to the households to buy their consumers' goods, and to the corporates to make investment. In contrast, the Islamic banking system grants loan based on a specific mechanism, which is the main advantage of s...
متن کاملNeural Network Modelling of Optimal Robot Movement Using Branch and Bound Tree
In this paper a discrete competitive neural network is introduced to calculate the optimal robot arm movements for processing a considered commitment of tasks, using the branch and bound methodology. A special method based on the branch and bound methodology, modified with a travelling path for adapting in the neural network, is introduced. The main neural network of the system consists of diff...
متن کاملGRID: An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends
In this paper we present a new interactive tool for computing orthogonal grid drawings of planar graphs. The tool is based on GDToolkit, an object-oriented library of classes for handling graphs and computing their layout. GDToolkit is built on LEDA (an eecient library of data types and algorithms) and currently implements three orthogonal layout methods. Especially, we provide a new branch-and...
متن کامل